Computing Science Group FULL ABSTRACTION FOR NOMINAL EXCEPTIONS AND GENERAL REFERENCES
نویسنده
چکیده
Game semantics has been used with considerable success in formulating fully abstract semantics for languages with higher-order procedures and a wide range of computational effects. Recently, nominal games have been proposed for modeling functional languages with names and nominal general references. Here we make a step further by developing a fully abstract semantics for a language with nominal exceptions and nominal general references.
منابع مشابه
Computing Science Group Nominal Game Semantics
Game Semantics arguably stands for one of the most successful techniques in denotational semantics, having provided not only proper denotational, accurate models for a large variety of programming languages, but also new semantical tools for program verification and validation. Most of all, over the last couple of decades, game semantics has contributed a novel understanding of computations, na...
متن کاملMechanizing the Metatheory of Standard ML
We present an internal language with equivalent expressive power to Standard ML, and discuss its formalization in LF and the machine-checked verification of its type safety in Twelf. The internal language is intended to serve as the target of elaboration in an elaborative semantics for Standard ML in the style of Harper and Stone. Therefore, it includes all the programming mechanisms necessary ...
متن کاملStages of abstraction and exemplar memorization in pigeon category learning.
It has been proposed that human category learning consists of an early abstraction-based stage followed by a later exemplar-memorization stage. To investigate whether similar processing stages extend to category learning in a nonverbal species, we applied a prototype-exception paradigm to investigating pigeon category learning. Five birds and 8 humans learned six-dimensional perceptual categori...
متن کاملAsymptotic Group Theory, Volume 48, Number 4
W hat is the probability that two randomly chosen permutations of 1, . . . , n generate the group Sn of all permutations of 1, . . . , n ? How many subgroups of index n can a group with two generators have? What can be said about a group of order 2n which has a nonidentity commutator of length n− 10? These questions all concern different aspects of a field which is very active nowadays and whic...
متن کاملExtracting and Utilizing of IS-A Relation Patterns for Question Answering Systems
Most of existing open domain question answering systems predefine the conceptual category to which answers can belong. So, they cannot generate appropriate answers in every case or must use a strategy that handles exceptions when the concept requested in the question is not prepared in the system. In this paper, we suggest a flexible strategy that can generate the candidate answers which corres...
متن کامل